Timing attacks: symbolic framework and proof techniques

We propose a framework for timing attacks, based on (a variant of) the applied-pi calculus. Since many privacy properties, as well as strong secrecy and game-based security properties, are stated as process equivalences, we focus on (time) trace equivalence. We show that actually, considering timing attacks does not add any complexity: time trace equivalence can be reduced to length trace equivalence, where the attacker no longer has access to execution times but can still compare the length of messages. We therefore deduce from a previous decidability result for length equivalence that time trace equivalence is decidable for bounded processes and the standard cryptographic primitives. As an application, we study several protocols that aim for privacy. In particular, we (automatically) detect an existing timing attack against the biometric passport and new timing attacks against the Private Authentication protocol

Lightweight Polymorphic Effects

Type-and-effect systems are a well-studied approach for reasoning about the computational behavior of programs. Nevertheless, there is only one example of an effect system that has been adopted in a wide-spread industrial language: Java’s checked exceptions. We believe that the main obstacle to using effect systems in day-to-day programming is their verbosity, especially when writing functions that are polymorphic in the effect of their argument. To overcome this issue, we propose a new syntactically lightweight technique for writing effect-polymorphic functions. We show its independence from a specific kind of side-effect by embedding it into a generic and extensible framework for checking effects of multiple domains. Finally, we verified the expressiveness and practicality of the system by implementing it for the Scala programming language

The Milky Way Bulge: Observed properties and a comparison to external galaxies

The Milky Way bulge offers a unique opportunity to investigate in detail the role that different processes such as dynamical instabilities, hierarchical merging, and dissipational collapse may have played in the history of the Galaxy formation and evolution based on its resolved stellar population properties. Large observation programmes and surveys of the bulge are providing for the first time a look into the global view of the Milky Way bulge that can be compared with the bulges of other galaxies, and be used as a template for detailed comparison with models. The Milky Way has been shown to have a box/peanut (B/P) bulge and recent evidence seems to suggest the presence of an additional spheroidal component. In this review we summarise the global chemical abundances, kinematics and structural properties that allow us to disentangle these multiple components and provide constraints to understand their origin. The investigation of both detailed and global properties of the bulge now provide us with the opportunity to characterise the bulge as observed in models, and to place the mixed component bulge scenario in the general context of external galaxies. When writing this review, we considered the perspectives of researchers working with the Milky Way and researchers working with external galaxies. It is an attempt to approach both communities for a fruitful exchange of ideas.Comment: Review article to appear in "Galactic Bulges", Editors: Laurikainen E., Peletier R., Gadotti D., Springer Publishing. 36 pages, 10 figure

Pascual López: autobiografía de un estudiante de medicina

We propose an integration of structural subtyping with boolean connectives and semantic subtyping to define a Java-like programming language that exploits the benefits of both techniques. Semantic subtyping is an approach to defining subtyping relation based on set-theoretic models, rather than syntactic rules. On the one hand, this approach involves some non trivial mathematical machinery in the background. On the other hand, final users of the language need not know this machinery and the resulting subtyping relation is very powerful and intuitive. While semantic subtyping is naturally linked to the structural one, we show how the framework can also accommodate the nominal subtyping. Several examples show the expressivity and the practical advantages of our proposal. © 2013 IFIP International Federation for Information Processing

Some aspects of the Liouville equation in mathematical physics and statistical mechanics

This paper presents some mathematical aspects of Classical Liouville theorem and we have noted some mathematical theorems about its initial value problem. Furthermore, we have implied on the formal frame work of Stochastic Liouville equation (SLE)

Argus: Rete + dbms = efficient persistent profile matching on large-volume data streams

Abstract. Efficient processing of complex streaming data presents multiple challenges, especially when combined with intelligent detection of hidden anomalies in real time. We label such systems Stream Anomaly Monitoring Systems (SAMS), and describe the CMU/Dynamix ARGUS system as a new kind of SAMS to detect rare but high value patterns combining streaming and historical data. Such patterns may correspond to hidden precursors of terrorist activity, or early indicators of the onset of a dangerous disease, such as a SARS outbreak. Our method starts from an extension of the RETE algorithm for matching streaming data against multiple complex persistent queries, and proceeds beyond to transitivity inferences, conditional intermediate result materialization, and other such techniques to obtain both accuracy and efficiency, as demonstrated by the evaluation results outperforming classical techniques such as a modern DMBS.